3 0 Ju n 20 04 The method of characteristics , and ‘ problem 89 ’ of Graham , Knuth and Patashnik
نویسنده
چکیده
We apply the method of characteristics for the solution of pde’s to two combinatorial problems. The first is finding an explicit form for a distribution that arises in bioinformatics. The second is a question raised by Graham, Knuth and Patashnik abiout a sequence of generalized binomial coefficients. We find an exact formula, which factors in an interesting way, in the case where one of the six parameters of the problem vanishes. We also show that the associated polynomial sequence has real zeros only, provided that one parameter vanishes, and the other five are nonnegative.
منابع مشابه
Se p 20 04 The method of characteristics , and ‘ problem 89 ’ of Graham , Knuth and Patashnik
We apply the method of characteristics for the solution of pde's to two combinatorial problems. The first is finding an explicit form for a distribution that arises in bio-informatics. The second is a question raised by Graham, Knuth and Patashnik about a sequence of generalized binomial coefficients. We find an exact formula, which factors in an interesting way, in the case where one of the si...
متن کاملA Telescoping Method for Double Summations
We present a method to prove hypergeometric double summation identities. Given a hypergeometric term F (n, i, j), we aim to find a difference operator L = a0(n)N 0 + a1(n)N 1 + · · · + ar(n)N r and rational functions R1(n, i, j), R2(n, i, j) such that LF = ∆i(R1F ) + ∆j(R2F ). Based on simple divisibility considerations, we show that the denominators of R1 and R2 must possess certain factors wh...
متن کاملMore Polynomial Root Squeezing
1. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., John Wiley, 1968. 2. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1989. 3. R. Hirshon and R. De Simone, An offer you can’t refuse, Mathematics Magazine 81 (2008) 146–152. 4. L. Takács, On the classical ruin problems, J. American Stat...
متن کاملRoots of Polynomials Modulo Prime Powers
To say that R is a root set modulo n means that R is a subset of Z n , the ring of integers modulo n , and there is a polynomial the roots of which modulo n are exactly the elements of R . Note that [ and Z n are always root sets modulo n . It seems that only two papers have appeared which mention the nature of root sets modulo n , and then only at a very basic level : Sierpin ́ ski [3] and Choj...
متن کاملConcrete mathematics - a foundation for computer science
No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading concrete mathematics a foundation for computer science is also a way as one of the collective books that gives many advantages. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004